Equivalence and quantifier rules for logic with imperfect information
نویسندگان
چکیده
منابع مشابه
Equivalence and quantifier rules for logic with imperfect information
In this paper, we present a normal form theorem for a version of Independence Friendly logic, a logic with imperfect information. Lifting classical results to such logics turns out not to be straightforward, because independence conditions make the formulas sensitive for signalling phenomena. In particular, nested quantification over the same variable is shown to cause problems. For instance, r...
متن کاملDealing with imperfect information in Strategy Logic
We propose an extension of Strategy Logic (SL), in which one can both reason about strategizing under imperfect information and about players’ knowledge. One original aspect of our approach is that we do not force strategies to be uniform, i.e. consistent with the players’ information, at the semantic level; instead, one can express in the logic itself that a strategy should be uniform. To do s...
متن کاملImperfect Information in Logic and Concurrent Games
This paper builds on a recent definition of concurrent games as event structures and an application giving a concurrent-game model for predicate calculus. An extension to concurrent games with imperfect information, through the introduction of ‘access levels’ to restrict the allowable strategies, leads to a concurrent-game semantics for a variant of Hintikka and Sandu’s Independence-Friendly (I...
متن کاملA Logic of Knowledge and Strategies with Imperfect Information
In this paper we put forward Epistemic Strategy Logic (ESL), a logic of knowledge and strategies in contexts of imperfect information. ESL extends Strategy Logic by adding modal operators for individual and collective knowledge. This enhanced framework allows us to represent explicitly and to reason about the knowledge agents have of their own and other agents’ strategies. We provide a semantic...
متن کاملQuantifier Inference Rules for SMT proofs
This paper discusses advantages and disadvantages of some possible alternatives for inference rules that handle quantifiers in the proof format of the SMT-solver veriT. The quantifier-handling modules in veriT being fairly standard, we hope this will motivate the discussion among the PxTP audience around proof production for quantifier handling. This could generate ideas to help us improve our ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logic Journal of IGPL
سال: 2008
ISSN: 1367-0751,1368-9894
DOI: 10.1093/jigpal/jzn030